Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games
نویسندگان
چکیده
We define and examine priority mean-payoff games — a natural extension of parity games. By adapting the notion of Blackwell optimality borrowed from the theory of Markov decision processes we show that priority mean-payoff games can be seen as a limit of special multi-discounted games.
منابع مشابه
Blackwell Optimal Strategies in Priority mean-Payoff Games
One of the recurring themes in the theory of stochastic games is the interplay between discounted games and mean-payoff games. This culminates in the seminal paper of Mertens and Neyman [12] showing that mean-payoff games have a value and this value is the limit of the values of discounted games when the discount factor tends to 1. Note however that optimal strategies in both games are very dif...
متن کاملDeterministic Priority Mean-Payoff Games as Limits of Discounted Games
Inspired by the paper of de Alfaro, Henzinger and Majumdar [2] about discounted μ-calculus we show new surprising links between parity games and different classes of discounted games.
متن کاملPerfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination...
متن کاملGames Where You Can Play Optimally Without Any Memory
Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, the most popular games in this context are parity games and their cousins (Rabin, Streett and Muller games). Recently however also games with other types of payments, like discounted or mean-payoff [5,6], previously used only in...
متن کاملQuantitative Fair Simulation Gamest
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simula...
متن کامل